Informatique Th Eorique/computer Science on Locally Stratiied Logic Programs

نویسندگان

  • Anthony Karel Seda
  • Pascal Hitzler
چکیده

Sur les programmes logiques localement stratii es 1 Anthony Karel Seda & Pascal Hitzler R esum e { Des id ees el ementaires de topologie dynamique sont utilis ees pour une approche constructive de la s emantique des mod eles parfaits de Przymusinski pour programmes localement stratii es. Nos r esultats comportent des applications de niveau qui prennent valeurs dans un ordinal d enombrable ar-bitraire et nos m ethodes sont apparent ees a celles d'Apt, Blair et Walker pour les programmes strat-ii es. Nous montrons l'existence de mod eles support es uniques quand certaines in egalit es sont strictes, am eliorant ainsi les r esultats de Przymusinski pour les mod eles parfaits. Fitting a utilis e des m etriques pour etudier certains programmes non-stratii es qui apparaissent dans les probl emes de terminaison; nos r esultats compl etent sa m ethode. Abstract { Elementary ideas from topological dynamics are used to provide a constructive approach to Przymusinski's perfect model semantics for locally stratiied normal logic programs. Our results utilise level mappings which take values in an arbitrary countable ordinal, and our methods are akin to those of Apt, Blair and Walker for stratiied programs. We show the existence of unique supported models when certain inequalities are strict, improving Przymusinski's results for perfect models. Also, our results complement Fitting's treatment by metric methods of certain non-stratiied programs which occur in the context of termination problems in logic programming. Version frann caise abr eg ee { Soit P un programme logique normal au sens d eeni dans 4]. Nous con-sid erons P comme un ensemble (peut-^ etre innni) des clauses C du type A A 1 dans lequel A, tout A i et tout B j ne contiennent pas de variables. Le probl eme principal dans l' etude de tels programmes est d' etablir un rapport entre la s emantique d eclarative de P et la s emantique proc edurale de P. Autrement dit, de rattacher la th eorie des mod eles de P d'une part, aux interpr etes de P d'autre part et, pour ces derniers, d' etudier les probl emes tels que v eridicit e et compl etude. Dans la plupart des cas nous associerons un op erateur T P : I P ! I P a P, I P d esignant le treillis de toutes les interpr etations de Herbrand pour P et nous etudierons les points pr eex …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Abstract Machine for Fixed-order Dynamically Stratiied Programs

It is known that a xed computation rule, such as used in most logic programming systems, does not suuce for normal logic programs. For instance, SLS resolution, which evaluates programs according to the well-founded semantics, makes use of an oracle to determine the next literal to select in 5], and of ideal parallelism in 8]. Given these limits, it is natural to deene a subclass of normal prog...

متن کامل

Constraint Stratification in Deductive Databases

We propose a syntactic condition on deductive database programs that ensures a two-valued well-founded model. This condition, called constraint stratiication, is signiicantly more general than previous syntactic conditions such as stratiication and local stratiication. Modular stratiication has been proposed as a semantic (i.e., nonsyntactic) condition for ensuring a two-valued well-founded mod...

متن کامل

Quasi-stable Semantics of Logic Programs

1. Introduction The semantics of logic programming and deductive databases has been extensively studied in the past two decades. Many semantic theories have been proposed (see 3] for a survey). In this paper, we introduce a new semantic theory for logic programs. We choose the Well-Founded Semantics (WFS) 23] as our starting point because it has many desirable features. For any logic program th...

متن کامل

Constraint Strati cation in Deductive Databases

We propose a syntactic condition on deductive database programs that ensures a two-valued well-founded model. This condition, called constraint stratiication, is signiicantly more general than previous syntactic conditions such as stratiication and local stratiication. Modular stratiication has been proposed as a semantic (i.e., nonsyntactic) condition for ensuring a two-valued well-founded mod...

متن کامل

A Syntactic Stratification Condition Using Constraints

Stratiication conditions for logic programs aim to ensure a two-valued semantics by restricting the class of allowable programs. Previous stratiication conditions suuer from one of two problems. Some (such as modular stratiication and weak stratiication) are semantic, and cannot be recognized without examining the facts in addition to the rules of the program. Others (such as stratiication and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007